Mining Diversity on Networks.

A Study of a Software Cache Implementation of the OpenMP Memory Model for Multicore and Manycore Architectures.

Efficient FPGAs using nanoelectromechanical relays.

Dominating ranking algorithm for information retrieval.

Outage Throughput Maximization for OFDMA Systems with Feedback Channel Capacity Constraints.

Research on knowledge hierarchical induction for injection mould repairs based on rough set.

Outage Throughput Maximization for OFDMA Systems with Feedback Channel Capacity Constraints.

Updated Basis Lattice Reduction Based Sequential User Selection for Multiuser MIMO Systems.


Finding Value Reducts Using Rough Multisets.


The Research and Design of 3G Terminal Data Confidentiality Services.

On the capacity improvement of multicast throughput in wireless ad hoc networks with physical%2Dlayer network coding.

Resource allocation for OFDMA systems with guaranteed outage probabilities.

Accelerated Genetic Algorithms with Markov Chains.

Predicting query potential for personalization%2C classification or regression%3F

Secure and Efficient Trust Opinion Aggregation for Vehicular Ad%2DHoc Networks.



Entity Relationship Extraction Based on Potential Relationship Pattern.

Adaptive multi%2Dresolution labeling in virtual landscapes.

Physical Design Methodology for Godson%2D2G Microprocessor.

The Inverse Classification Problem.
We consider the inverse problem in classification systems described as follows. Given a set of prototype cases representing a set of categories, a similarity function, and a new case classified in some category, find the cost minimizing changes to the attribute values such that the case is reclassified as a member of a (different) preferred category. The problem is “inverse ” because the usual mapping is from a case to its unknown category. The increased application of classification systems in business suggests that this inverse problem can be of significant benefit to decision-makers as a form of sensitivity analysis. Analytic approaches to this inverse problem are difficult to formulate as the constraints are either not available or difficult to determine. To investigate this inverse problem, we develop several genetic algorithms and study their performance as problem difficulty increases. We develop a real genetic algorithm with feasibility control, a traditional binary genetic algorithm, and a steepest ascent hill-climbing algorithm. In a series of simulation experiments, we compare the performance of these algorithms to the optimal solution as the problem difficulty increases (more attributes and classes). In addition, we analyze certain algorithm effects (level of feasibility control, operator design, and fitness function) to determine the best approach. Our results indicate the viability of the real genetic algorithm and the importance of feasibility control as the problem difficulty increases.
A network coding based interference cancelation scheme for wireless ad hoc networks.

A Novel Fast Inter Mode Decision Algorithm in H.264%2FAVC for Forest Fire Prevention Surveillance.

Simulation and Research on Data.
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
An Effective Scheme for Defending Denial%2Dof%2DSleep Attack in Wireless Sensor Networks.

A Robust Detection of the Sybil Attack in Urban VANETs.

Study of Double SMO Algorithm Based on Attributes Reduction.

A Novel Deblocking Filter Algorithm in H.264 for Real Time Implementation.

Graph OLAP a multi%2Ddimensional framework for graph data analysis.

Mining Graph Patterns Efficiently via Randomized Summaries.

iNextCube Information Network%2DEnhanced Text Cube.
Nowadays, most business, administration, and/or scientific databases contain both structured attributes and text attributes. We call a database that consists of both multidimensional structured data and narrative text data as multidimensional text database. Searching, OLAP, and mining such databases pose many research challenges. To enhance the power of data analysis, interesting entities and relationships can be extracted from such databases to derive heterogeneous information networks, which in turn will substantially increase the power and flexibility of data exploration in such databases. Based on our previous studies on TextCube [1], TopicCube [2], and information network analysis, such as RankClus [3] and NetClus [4], we construct iNextCube, an information-Network-enhanced text Cube. In this demo, we show the power of iNextCube in the search and analysis of two multidimensional text databases: (i) a DBLP-based CS bibliographic database, and (ii) an online news database. 1.
A novel synchronization scheme for grid%2Dconnected converters by using adaptive linear optimal filter based PLL %28ALOF%2DPLL%29.

On effective presentation of graph patterns a structural representative approach.
RESEARCH INTERESTS I am generally interested in data mining, data warehousing and database systems. My current research focuses on modeling, managing and analyzing large-scale graph and information network data.
An Improved LOS Method for Implementing Visibility Analysis of 3D Complex Landscapes.

Application of MVNR Algorithm on Data Analyses of Forest Inventory.

Knowledge Induction for Injection Mould Repairs Based on Rough Set.

Research on Hybrid Index for Chinese IR.

The Throughput Order of Ad Hoc Networks with Physical%2DLayer Network Coding and Analog Network Coding.

A fine%2Dgrained time%2Dconstraint role%2Dbased access control using OCL.

Graph OLAP Towards Online Analytical Processing on Graphs.
RESEARCH INTERESTS I am generally interested in data mining, data warehousing and database systems. My current research focuses on modeling, managing and analyzing large-scale graph and information network data.
MMFI An Effective Algorithm for Mining Maximal Frequent Itemsets.

GPU%2DMEME Using Graphics Hardware to Accelerate Motif Finding in DNA Sequences.

A Congestion Avoidance and Performance Enhancement Scheme for Mobile Ad Hoc Networks.

GPU%2DMEME Using Graphics Hardware to Accelerate Motif Finding in DNA Sequences.

A High%2DQ Microwave MEMS Resonator

A Hybrid Computational Grid Architecture for Comparative Genomics.

A novel harmonic%2Dfree power factor corrector based on T%2Dtype APF with adaptive linear neural network %28ADALINE%29 control.

Topic%2DOriented Search Model Based on Multi%2DAgent.


Building a Macroeconomic Multidimensional Statistical Data Warehouse for Beijing E%2DGovernment.


gApprox Mining Frequent Approximate Patterns from a Massive Network.
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, demanding powerful data mining methods. Due to inherent noise or data diversity, it is crucial to address the issue of approximation, if one wants to mine patterns that are potentially interesting with tolerable variations. In this paper, we investigate the problem of mining frequent approximate patterns from a massive network and propose a method called gApprox. gApprox not only finds approximate network patterns, which is the key for many knowledge discovery applications on structural data, but also enriches the library of graph mining methodologies by introducing several novel techniques such as: (1) a complete and redundancy-free strategy to explore the new pattern space faced by gApprox; and (2) transform “frequent in an approximate sense ” into an anti-monotonic constraint so that it can be pushed deep into the mining process. Systematic empirical studies on both real and synthetic data sets show that frequent approximate patterns mined from the worm protein-protein interaction network are biologically interesting and gApprox is both effective and efficient. 1
Information Stream Based Network Dynamic Reconfiguration.

Towards Graph Containment Search and Indexing.
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ∈ D such that q contains g (q ⊇ g). Due to the wide adoption of graph models, fast containment search of graph data finds many applications in various domains. In comparison to traditional graph search that retrieves all the graphs containing q (q ⊆ g), containment search has its own indexing characteristics that have not yet been examined. In this paper, we perform a systematic study on these characteristics and propose a contrast subgraph-based indexing model, called cIndex. Contrast subgraphs capture the structure differences between model graphs and query graphs, and are thus perfect for indexing due to their high selectivity. Using a redundancy-aware feature selection process, cIndex can sort out a set of significant and distinctive contrast subgraphs and maximize its indexing capability. We show that it is NP-complete to choose the best set of indexing features, and our greedy algorithm can approximate the one-level optimal index within a ratio of 1 − 1/e. Taking this solution as a base indexing model, we further extend it to accommodate hierarchical indexing methodologies and apply data space clustering and sampling techniques to reduce the index construction time. The proposed methodology provides a general solution to containment search and indexing, not only for graphs, but also for any data with transitive relations as well. Experimental results on real test data show that cIndex achieves near-optimal pruning power on various containment search workloads, and confirms its obvious advantage over indices built for traditional graph search in this new scenario. 1.
A Ku%2DBand Novel Micromachined Bandpass Filter with Two Transmission Zeros

Progressive transmission and rendering of foveated volume data.
Abstract: With development of biomedical and networking technology, interactive volume rendering with data transmitted via the network becomes an interesting topic. Two technical problems are data transmission and fast volume rendering. In this paper, two schemes using Wavelet foveation are proposed and implemented: the region-based and coarse-to-fine. The first scheme transmits and renders the region of interest (ROI) of volume data on the client site at highest resolution for the first time, and consequently it iteratively expands the region layer by layer towards to the peripheral. While the second one gives a complete image in a low resolution for the first time on the client. The detail coefficients will be transmitted continuously and the rendering result will be progressively refined depending on the distance to the ROI. 1
Available Bandwidth Estimation in IEEE802.11b Network Based on Non%2DIntrusive Measurement.

On the Inverse Classification Problem and its Applications.
RESEARCH INTERESTS I am generally interested in data mining, data warehousing and database systems. My current research focuses on modeling, managing and analyzing large-scale graph and information network data.
GPLAG detection of software plagiarism by program dependence graph analysis.
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source projects for its own products. Although current plagiarism detection tools appear sufficient for academic use, they are nevertheless short for fighting against serious plagiarists. For example, disguises like statement reordering and code insertion can effectively confuse these tools. In this paper, we develop a new plagiarism detection tool, called GPlag, which detects plagiarism by mining program dependence graphs (PDGs). A PDG is a graphic representation of the data and control dependencies within a procedure. Because PDGs are nearly invariant during plagiarism, GPlag is more effective than state-of-the-art tools for plagiarism detection. In order to make GPlag scalable to large programs, a statistical lossy filter is proposed to prune the plagiarism search space. Experiment study shows that GPlag is both effective and efficient: It detects plagiarism that easily slips over existing tools, and it usually takes a few seconds to find (simulated) plagiarism in programs having thousands of lines of code.
Available Bandwidth Estimation in IEEE802.11b Network Based on Non%2DIntrusive Measurement.

Dynamic TXOP Assignment for Fairness %28DTAF%29 in IEEE 802.11e WLAN under Heavy Load Conditions.

Towards Robust Indexing for Ranked Queries.
RESEARCH INTERESTS I am generally interested in data mining, data warehousing and database systems. My current research focuses on modeling, managing and analyzing large-scale graph and information network data.
Synchronization Acquisition Methods for DRM Systems.

Rounding Mismatch Between Spatial%2DDomain and Transform%2DDomain Video Codecs.

On Using Linear Periodically resetting Filter in Current Control Loop for Active Power Filter.


Personalized Cyber Face A Novel Facial Modeling Approach using Multi%2DLevel Radial Basis Function.

Transform%2Ddomain intra prediction for H.264.


The Application of the BSP Model on DataGrid.

An efficient estimator for OFDM integer frequency offset synchronization.

A Robust MDPSK Modulation Classifier Based on Cumulants.

Local Reduction of fold bifurcation Relevant to voltage Collapse in an Electric Power System.

Architectures for System%2DLevel Applications of Adaptive Computing.

Event Adaption for Integrating Distributed Applications.

A Packager for Multicast Software in Distributed Systems.
Prototyping is an important part of modern software development projects, and the ease with which prototyping apparatus can be assembled for experimentation is a major factor in the effectiveness of a prototyping operation. If interconnecting existing components for experimentation is too expensive, then the benefits promised from prototyping will remain unrealized. Multicast is one run-time technology which delivers on the promise of low-cost interconnection --- but only once the components are prepared to execute within a multicast system. Moreover, finding ways for prototypers to view their apparatus (from what, in multicast, can be a very tangled logical structure) can be difficult. In support of a software prototyping initiative, we have produced a new packaging technology which automates the task of adapting software components for execution within multicast execution environments. This paper describes our new packager, along with our experiences in use of the system to date. In ...
